Relaxation strategy for the Landweber method
نویسندگان
چکیده
منابع مشابه
Projected Landweber method and preconditioning
The projected Landweber method is an iterative method for solving constrained least-squares problems when the constraints are expressed in terms of a convex and closed set C. The convergence properties of the method have been recently investigated. Moreover, it has important applications to many problems of signal processing and image restoration. The practical difficulty is that the convergenc...
متن کاملLagrangian Relaxation Method for the Step fixed-charge Transportation Problem
In this paper, a step fixed charge transportation problem is developed where the products are sent from the sources to the destinations in existence of both unit and step fixed-charges. The proposed model determines the amount of products in the existing routes with the aim of minimizing the total cost (sum of unit and step fixed-charges) to satisfy the demand of each customer. As the problem i...
متن کاملa paradigm shift away from method-wise teaching to strategy-wise teaching: an investigation of reconstructive strategy versus communicative strategy
چکیده: هدف اصلی این مطالعه ی توصیفی تحقیقی در حقیقت تلاشی پساروش-گرا به منظور رسیدن به نتیجه ای منطقی در انتخاب مناسبترین راهکار آموزشی بر گرفته از چارچوب راهبردی مطرح شده توسط والدمر مارتن بوده که به بهترین شکل سازگار و مناسب با سامانه ی آموزشی ایران باشد. از این رو، دو راهکار آموزشی، راهکار ارتباطی و راهکار بازساختی، برای تحقیق و بررسی انتخاب شدند. صریحاً اینکه، در راستای هدف اصلی این پژوهش، ر...
15 صفحه اولThe Lagrangian Relaxation Method for the Shortest Path Problem Considering Transportation Plans and Budgetary Constraint
In this paper, a constrained shortest path problem (CSP) in a network is investigated, in which some special plans for each link with corresponding pre-determined costs as well as reduction values in the link travel time are considered. The purpose is to find a path and selecting the best plans on its links, to improve the travel time as most as possible, while the costs of conducting plans do ...
متن کاملLandweber-kaczmarz Method in Banach Spaces with Inexact Inner Solvers
In recent years Landweber(-Kaczmarz) method has been proposed for solving nonlinear ill-posed inverse problems in Banach spaces using general convex penalty functions. The implementation of this method involves solving a (nonsmooth) convex minimization problem at each iteration step and the existing theory requires its exact resolution which in general is impossible in practical applications. I...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Signal Processing
سال: 2016
ISSN: 0165-1684
DOI: 10.1016/j.sigpro.2016.01.010